Direct Spherical Harmonic Transform of a Triangulated Mesh

نویسندگان

  • Mohamed-Hamed Mousa
  • Raphaëlle Chaine
  • Samir Akkouche
چکیده

Spherical harmonic transform plays an important role in research in shape description. Current computation methods involve expensive voxelization, and are prone to numerical errors associated with the size of the voxels. This paper describes a fast and accurate technique for computing spherical harmonic coe cients directly from the description of the mesh.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watermarking on 3D mesh based on spherical wavelet transform.

In this paper we propose a robust watermarking algorithm for 3D mesh. The algorithm is based on spherical wavelet transform. Our basic idea is to decompose the original mesh into a series of details at different scales by using spherical wavelet transform; the watermark is then embedded into the different levels of details. The embedding process includes: global sphere parameterization, spheric...

متن کامل

A Fast Transform for Spherical Harmonics

Spherical Harmonics arise on the sphere S in the same way that the (Fourier) exponential functions {e}k∈Z arise on the circle. Spherical Harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform. Without a fast transform, evaluating (or expanding in) Spherical Har...

متن کامل

Fast, exact (but unstable) spin spherical harmonic transforms

We derive algorithms to perform a spin spherical harmonic transform and inverse for functions of arbitrary spin number. These algorithms involve recasting the spin transform on the two-sphere S as a Fourier transform on the two-torus T. Fast Fourier transforms are then used to compute Fourier coefficients, which are related to spherical harmonic coefficients through a linear transform. By recas...

متن کامل

3D Models Recognition in Fourier Domain Using Compression of the Spherical Mesh up to the Models Surface

Representing 3D models in diverse fields have automatically paved the way of storing, indexing, classifying, and retrieving 3D objects. Classification and retrieval of 3D models demand that the 3D models represent in a way to capture the local and global shape specifications of the object. This requires establishing a 3D descriptor or signature that summarizes the pivotal shape properties of th...

متن کامل

Fast Spherical Harmonic Transform Algorithm based on Generalized Fast Multipole Method

Spherical harmonic transform is the most important orthogonal function transform only except Fourier transform, and is used not only for climate simulation and signal processing but also for a base of several numerical algorithms. Fast Fourier Transform (FFT), which runs in time O(N logN) is quite well known, but, for spherical harmonic transform, there is no fast algorithm which is as simple a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graphics Tools

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2006